Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for University Course Timetabling Problems
The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...
متن کاملA Guided Search Genetic Algorithm for the University Course Timetabling Problem
The university course timetabling problem is a combinatorial optimisation problem in which a set of events has to be scheduled in time slots and located in suitable rooms. The design of course timetables for academic institutions is a very difficult task because it is an NP-hard problem. This paper proposes a genetic algorithm with a guided search strategy and a local search technique for the u...
متن کاملA Guided Search Non-dominated Sorting Genetic Algorithm for the Multi-Objective University Course Timetabling Problem
The university course timetabling problem is a typical combinatorial optimization problem. This paper tackles the multi-objective university course timetabling problem (MOUCTP) and proposes a guided search non-dominated sorting genetic algorithm to solve the MOUCTP. The proposed algorithm integrates a guided search technique, which uses a memory to store useful information extracted from previo...
متن کاملMulti-Neighbourhood Local Search for Course Timetabling
One of the most critical features for applying local search to timetabling problems is the definition of the neighbourhood structure. In fact, for most common timetabling problems, there is more than one neighbourhood structure that is sufficiently natural and intuitive to deserve investigation. The reason for considering combination of diverse neighbourhood is related to the diversification of...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
سال: 2011
ISSN: 1094-6977
DOI: 10.1109/tsmcc.2010.2049200